A Survey on Network Tomography With Network Coding
نویسندگان
چکیده
منابع مشابه
Vulnerability Measure of a Network - a Survey
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where disruption of the graph is caused by the removal of a vertex or vertices (and the resulting...
متن کاملSurvey of Network Coding and Its Applications
This survey summarizes the state-of-the-art research on network coding, mainly focusing on its applications to computer networking. Network coding generalizes traditional store-and-forward routing techniques by allowing intermediate nodes in networks to encode several received packets into a single coded packet before forwarding. Network coding was proposed in 2000, and since then, it has been ...
متن کاملUsing Bayesian network on network tomography
Network tomography aims to obtain link-level performance characteristics, such as loss rate and average delay on each link, by end-to-end measurement. The obtained information can help us to understand the dynamic nature of networks. A number of methods have been proposed in recent years, which can be divided into two classes: multicast-based and unicast-based. In this paper, we propose an appr...
متن کاملOn quantum network coding
We study the problem of error-free multiple unicast over directed acyclic networks in a quantum setting. We provide a new information-theoretic proof of the known result that network coding does not achieve a larger quantum information flow than what can be achieved by routing for two-pair communication on the butterfly network. We then consider a k-pair multiple unicast problem and for all k ≥...
متن کاملOn Randomized Network Coding∗
We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of receivers and random coding output link...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Surveys & Tutorials
سال: 2014
ISSN: 1553-877X
DOI: 10.1109/comst.2014.2320096